Topology of strings: Median string is NP-complete
نویسندگان
چکیده
منابع مشابه
Topology of Strings: Median String is NP-Complete
Given a set of strings, the problem of finding a string that minimises its distance to the set is directly related with problems frequently encountered in areas involving Pattern Recognition or Computational Biology. Based on the Levenshtein (or edit) distance, different definitions of distances between a string and a set of strings can be adopted. In particular, if this definition is the sum o...
متن کامل- 1 - Topology of Strings : Median String is NP - Complete
Given a set of strings, the problem of finding a string that minimises its distance to the set is directly related with problems frequently encountered in areas involving Pattern Recognition or Computational Biology. Based on the Levenshtein (or edit) distance, different definitions of distances between a string and a set of strings can be adopted. In particular, if this definition is the sum o...
متن کاملThe transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the most important distance measures are the reversal distance and the transposition distance. The two main tasks in all phylogenetic reconstruction algorithms is to calculate pairwise distances and to solve the median of t...
متن کاملString topology and infinite strings
In this paper, we will be considering a new definition of infinite strings over a finite alphabet. The conventional definition of a finite string does not involve the process of string formation but implicity assumes that the strings are formed by insertions of letters at the end, which results in a definition of an infinite sequence of letters. This definition is incomplete, because other proc...
متن کاملThe consensus string problem for a metric is NP-complete
KUNSOO PARK 1, School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Korea, E-mail:[email protected] ABSTRACT: Given a set S of strings, a consensus string of S based on consensus error is a string w that minimizes the sum of the distances between w and all the strings in S. In this paper, we show that the problem of finding a consensus string based on conse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00240-5